Counting 1-vertex triangulations of oriented surfaces
نویسندگان
چکیده
A 1−vertex triangulation of an oriented compact surface S of genus g is an embedded graph T ⊂ S with a unique vertex such that all connected components of S \ T are triangles (adjacent to exactly 3 edges of T ). This paper gives formulas enumerating such triangulations (up to equivalence) on an oriented surface of given genus. Une triangulation à un sommet d’une surface orientée compacte S de genre g est un graphe T ⊂ S qui a un unique sommet et dont toutes les faces (composantes connexes de S \ T ) sont des triangles (incidentes à trois arêtes de T ). Cet article donne des formules permettant d’énumérer ces triangulations.
منابع مشابه
Nonrealizable Minimal Vertex Triangulations of Surfaces: Showing Nonrealizability Using Oriented Matroids and Satisfiability Solvers
We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R. We also provide examples of minimal vertex triangulations of closed, connected, orientable 2-manifolds of genus 5 that do not admit any polyhedral embeddings. We construct a new infinite family of non-realizable triangulations of surfaces. These results were ...
متن کاملLayered - Triangulations of 3 – Manifolds
A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...
متن کاملDynamic updates of succinct triangulations
In a recent article, we presented a succinct representation of triangulations that supports efficient navigation operations. Here this representation is improved to allow for efficient local updates of the triangulations. Precisely, we show how a succinct representation of a triangulation with m triangles can be maintained under vertex insertions in O(1) amortized time and under vertex deletion...
متن کاملContinuous Spatial Indexing of Surfaces — Part I: Standard Triangulations
We show how to build a continuous, one-dimensional index of the points on a triangulated, two-dimensional manifold T . The index is constructed by quickly finding a vertex-adjacent ordering of the triangles (that is, sequential triangles share at least one vertex). Then the space within triangles is indexed with a spacefilling curve oriented so that the lowest point in each triangle is the vert...
متن کاملA Fast Algorithm for Computing Irreducible Triangulations of Closed Surfaces in E and Its Application to the TriQuad Problem
Let S be a compact surface with empty boundary. A classical result from the 1920s by Tibor Radó asserts that every compact surface with empty boundary (usually called a closed surface) admits a triangulation [1]. Let e be any edge of a triangulation T of S . The contraction of e in T consists of contracting e to a single vertex and collapsing each of the two triangles meeting e into a single ed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 246 شماره
صفحات -
تاریخ انتشار 2002